0.03/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.03/0.12 % Command : run_vampire %s %d THM 0.12/0.33 % Computer : n006.cluster.edu 0.12/0.33 % Model : x86_64 x86_64 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.12/0.33 % Memory : 8042.1875MB 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 0.12/0.33 % CPULimit : 1920 0.12/0.33 % WCLimit : 240 0.12/0.33 % DateTime : Wed Jul 30 02:30:34 EDT 2025 0.12/0.34 % CPUTime : 0.21/0.35 This is a THF_ problem 0.21/0.36 Running higher-order theorem proving 0.21/0.37 Running /export/starexec/sandbox/solver/bin/vampire_ho --cores 7 --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol /export/starexec/sandbox/tmp/tmp.jFn1ibUF28/E---3.1_20703.p -m 16384 -t 240 0.21/0.39 % (20813)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on E---3.1_20703 for (2399ds/2Mi) 0.21/0.39 % (20812)dis+1010_1:1_au=on:cbe=off:chr=on:fsr=off:hfsq=on:nm=64:sos=theory:sp=weighted_frequency:i=27:si=on:rtra=on_0 on E---3.1_20703 for (2399ds/27Mi) 0.21/0.39 % (20810)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on E---3.1_20703 for (2399ds/183Mi) 0.21/0.39 % (20811)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on E---3.1_20703 for (2399ds/4Mi) 0.21/0.39 % (20814)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on E---3.1_20703 for (2399ds/2Mi) 0.21/0.39 % (20815)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on E---3.1_20703 for (2399ds/275Mi) 0.21/0.39 % (20816)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on E---3.1_20703 for (2399ds/18Mi) 0.21/0.39 % (20813)Instruction limit reached! 0.21/0.39 % (20813)------------------------------ 0.21/0.39 % (20813)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200) 0.21/0.39 % (20813)Termination reason: Unknown 0.21/0.39 % (20813)Termination phase: shuffling 0.21/0.39 % (20814)Instruction limit reached! 0.21/0.39 % (20814)------------------------------ 0.21/0.39 % (20814)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200) 0.21/0.39 0.21/0.39 % (20813)Memory used [KB]: 1023 0.21/0.39 % (20813)Time elapsed: 0.004 s 0.21/0.39 % (20813)Instructions burned: 3 (million) 0.21/0.39 % (20813)------------------------------ 0.21/0.39 % (20813)------------------------------ 0.21/0.39 % (20814)Termination reason: Unknown 0.21/0.39 % (20814)Termination phase: shuffling 0.21/0.39 0.21/0.39 % (20814)Memory used [KB]: 1023 0.21/0.39 % (20814)Time elapsed: 0.004 s 0.21/0.39 % (20814)Instructions burned: 3 (million) 0.21/0.39 % (20814)------------------------------ 0.21/0.39 % (20814)------------------------------ 0.21/0.39 % (20811)Instruction limit reached! 0.21/0.39 % (20811)------------------------------ 0.21/0.39 % (20811)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200) 0.21/0.39 % (20811)Termination reason: Unknown 0.21/0.39 % (20811)Termination phase: Property scanning 0.21/0.39 0.21/0.39 % (20811)Memory used [KB]: 1023 0.21/0.39 % (20811)Time elapsed: 0.005 s 0.21/0.39 % (20811)Instructions burned: 4 (million) 0.21/0.39 % (20811)------------------------------ 0.21/0.39 % (20811)------------------------------ 0.21/0.39 % (20815)First to succeed. 0.21/0.40 % (20810)Also succeeded, but the first one will report. 0.21/0.40 % (20812)Also succeeded, but the first one will report. 0.21/0.40 % (20815)Refutation found. Thanks to Tanya! 0.21/0.40 % SZS status Theorem for E---3.1_20703 0.21/0.40 % SZS output start Proof for E---3.1_20703 0.21/0.40 thf(func_def_0, type, in: $i > ($i > $o) > $o). 0.21/0.40 thf(func_def_2, type, is_a: $i > ($i > $o) > $o). 0.21/0.40 thf(func_def_3, type, emptyset: $i > $o). 0.21/0.40 thf(func_def_4, type, unord_pair: $i > $i > $i > $o). 0.21/0.40 thf(func_def_5, type, singleton: $i > $i > $o). 0.21/0.40 thf(func_def_6, type, union: ($i > $o) > ($i > $o) > $i > $o). 0.21/0.40 thf(func_def_7, type, excl_union: ($i > $o) > ($i > $o) > $i > $o). 0.21/0.40 thf(func_def_8, type, intersection: ($i > $o) > ($i > $o) > $i > $o). 0.21/0.40 thf(func_def_9, type, setminus: ($i > $o) > ($i > $o) > $i > $o). 0.21/0.40 thf(func_def_10, type, complement: ($i > $o) > $i > $o). 0.21/0.40 thf(func_def_11, type, disjoint: ($i > $o) > ($i > $o) > $o). 0.21/0.40 thf(func_def_12, type, subset: ($i > $o) > ($i > $o) > $o). 0.21/0.40 thf(func_def_13, type, meets: ($i > $o) > ($i > $o) > $o). 0.21/0.40 thf(func_def_14, type, misses: ($i > $o) > ($i > $o) > $o). 0.21/0.40 thf(func_def_15, type, cartesian_product: ($i > $o) > ($i > $o) > $i > $i > $o). 0.21/0.40 thf(func_def_16, type, pair_rel: $i > $i > $i > $i > $o). 0.21/0.40 thf(func_def_17, type, id_rel: ($i > $o) > $i > $i > $o). 0.21/0.40 thf(func_def_18, type, sub_rel: ($i > $i > $o) > ($i > $i > $o) > $o). 0.21/0.40 thf(func_def_19, type, is_rel_on: ($i > $i > $o) > ($i > $o) > ($i > $o) > $o). 0.21/0.40 thf(func_def_20, type, restrict_rel_domain: ($i > $i > $o) > ($i > $o) > $i > $i > $o). 0.21/0.40 thf(func_def_21, type, rel_diagonal: $i > $i > $o). 0.21/0.40 thf(func_def_22, type, rel_composition: ($i > $i > $o) > ($i > $i > $o) > $i > $i > $o). 0.21/0.40 thf(func_def_23, type, reflexive: ($i > $i > $o) > $o). 0.21/0.40 thf(func_def_24, type, irreflexive: ($i > $i > $o) > $o). 0.21/0.40 thf(func_def_25, type, symmetric: ($i > $i > $o) > $o). 0.21/0.40 thf(func_def_26, type, transitive: ($i > $i > $o) > $o). 0.21/0.40 thf(func_def_27, type, equiv_rel: ($i > $i > $o) > $o). 0.21/0.40 thf(func_def_28, type, rel_codomain: ($i > $i > $o) > $i > $o). 0.21/0.40 thf(func_def_29, type, rel_domain: ($i > $i > $o) > $i > $o). 0.21/0.40 thf(func_def_30, type, rel_inverse: ($i > $i > $o) > $i > $i > $o). 0.21/0.40 thf(func_def_31, type, equiv_classes: ($i > $i > $o) > ($i > $o) > $o). 0.21/0.40 thf(func_def_32, type, restrict_rel_codomain: ($i > $i > $o) > ($i > $o) > $i > $i > $o). 0.21/0.40 thf(func_def_33, type, rel_field: ($i > $i > $o) > $i > $o). 0.21/0.40 thf(func_def_34, type, well_founded: ($i > $i > $o) > $o). 0.21/0.40 thf(func_def_35, type, upwards_well_founded: ($i > $i > $o) > $o). 0.21/0.40 thf(func_def_52, type, sK0: $i > $i > $o). 0.21/0.40 thf(func_def_53, type, sK1: $i > $i > $o). 0.21/0.40 thf(f125,plain,( 0.21/0.40 $false), 0.21/0.40 inference(trivial_inequality_removal,[],[f124])). 0.21/0.40 thf(f124,plain,( 0.21/0.40 ($false = $true)), 0.21/0.40 inference(beta_eta_normalization,[],[f123])). 0.21/0.40 thf(f123,plain,( 0.21/0.40 ($false = ((^[Y0 : $i]: ($true)) @ sK4))), 0.21/0.40 inference(sigma_clausification,[],[f122])). 0.21/0.40 thf(f122,plain,( 0.21/0.40 ($false = (!! @ $i @ (^[Y0 : $i]: ($true))))), 0.21/0.40 inference(beta_eta_normalization,[],[f121])). 0.21/0.40 thf(f121,plain,( 0.21/0.40 (((^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ($true)))) @ sK3) = $false)), 0.21/0.40 inference(sigma_clausification,[],[f120])). 0.21/0.40 thf(f120,plain,( 0.21/0.40 ($true != (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ($true))))))), 0.21/0.40 inference(boolean_simplification,[],[f119])). 0.21/0.40 thf(f119,plain,( 0.21/0.40 ($true != (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((sK1 @ Y1 @ Y0) => $true))))))), 0.21/0.40 inference(boolean_simplification,[],[f118])). 0.21/0.40 thf(f118,plain,( 0.21/0.40 ($true != (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((sK1 @ Y1 @ Y0) => ($true & $true)))))))), 0.21/0.40 inference(beta_eta_normalization,[],[f117])). 0.21/0.40 thf(f117,plain,( 0.21/0.40 ($true != ((^[Y0 : $i > $i > $o]: ((^[Y1 : $i > $i > $o]: (!! @ $i @ (^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: ((Y0 @ Y3 @ Y2) => (Y1 @ Y3 @ Y2))))))))) @ sK1 @ ((^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ((^[Y3 : $i]: ((Y1 @ Y3) & (Y0 @ Y2))))))))) @ (^[Y0 : $i]: ($true)) @ (^[Y0 : $i]: ($true)))))), 0.21/0.40 inference(definition_unfolding,[],[f113,f115,f112])). 0.21/0.40 thf(f112,plain,( 0.21/0.40 (cartesian_product = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ((^[Y3 : $i]: ((Y1 @ Y3) & (Y0 @ Y2))))))))))), 0.21/0.40 inference(cnf_transformation,[],[f53])). 0.21/0.40 thf(f53,plain,( 0.21/0.40 (cartesian_product = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ((^[Y3 : $i]: ((Y1 @ Y3) & (Y0 @ Y2))))))))))), 0.21/0.40 inference(fool_elimination,[],[f52])). 0.21/0.40 thf(f52,plain,( 0.21/0.40 ((^[X0 : $i > $o, X1 : $i > $o, X2 : $i, X3 : $i] : ((X0 @ X2) & (X1 @ X3))) = cartesian_product)), 0.21/0.40 inference(rectify,[],[f15])). 0.21/0.40 thf(f15,axiom,( 0.21/0.40 ((^[X0 : $i > $o, X2 : $i > $o, X3 : $i, X4 : $i] : ((X0 @ X3) & (X2 @ X4))) = cartesian_product)), 0.21/0.40 file('/export/starexec/sandbox/tmp/tmp.jFn1ibUF28/E---3.1_20703.p',cartesian_product)). 0.21/0.40 thf(f115,plain,( 0.21/0.40 (sub_rel = (^[Y0 : $i > $i > $o]: ((^[Y1 : $i > $i > $o]: (!! @ $i @ (^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: ((Y0 @ Y3 @ Y2) => (Y1 @ Y3 @ Y2))))))))))), 0.21/0.40 inference(cnf_transformation,[],[f77])). 0.21/0.40 thf(f77,plain,( 0.21/0.40 (sub_rel = (^[Y0 : $i > $i > $o]: ((^[Y1 : $i > $i > $o]: (!! @ $i @ (^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: ((Y0 @ Y3 @ Y2) => (Y1 @ Y3 @ Y2))))))))))), 0.21/0.40 inference(fool_elimination,[],[f76])). 0.21/0.40 thf(f76,plain,( 0.21/0.40 ((^[X0 : $i > $i > $o, X1 : $i > $i > $o] : (! [X2,X3] : ((X0 @ X2 @ X3) => (X1 @ X2 @ X3)))) = sub_rel)), 0.21/0.40 inference(rectify,[],[f18])). 0.21/0.40 thf(f18,axiom,( 0.21/0.40 ((^[X6 : $i > $i > $o, X7 : $i > $i > $o] : (! [X0,X2] : ((X6 @ X0 @ X2) => (X7 @ X0 @ X2)))) = sub_rel)), 0.21/0.40 file('/export/starexec/sandbox/tmp/tmp.jFn1ibUF28/E---3.1_20703.p',sub_rel)). 0.21/0.40 thf(f113,plain,( 0.21/0.40 ((sub_rel @ sK1 @ (cartesian_product @ (^[Y0 : $i]: ($true)) @ (^[Y0 : $i]: ($true)))) != $true)), 0.21/0.40 inference(cnf_transformation,[],[f110])). 0.21/0.40 thf(f110,plain,( 0.21/0.40 ((sub_rel @ sK1 @ sK0) = $true) & ((sub_rel @ sK1 @ (cartesian_product @ (^[Y0 : $i]: ($true)) @ (^[Y0 : $i]: ($true)))) != $true)), 0.21/0.40 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f108,f109])). 0.21/0.40 thf(f109,plain,( 0.21/0.40 ? [X0 : $i > $i > $o,X1 : $i > $i > $o] : (((sub_rel @ X1 @ X0) = $true) & ($true != (sub_rel @ X1 @ (cartesian_product @ (^[Y0 : $i]: ($true)) @ (^[Y0 : $i]: ($true)))))) => (((sub_rel @ sK1 @ sK0) = $true) & ((sub_rel @ sK1 @ (cartesian_product @ (^[Y0 : $i]: ($true)) @ (^[Y0 : $i]: ($true)))) != $true))), 0.21/0.40 introduced(choice_axiom,[])). 0.21/0.40 thf(f108,plain,( 0.21/0.40 ? [X0 : $i > $i > $o,X1 : $i > $i > $o] : (((sub_rel @ X1 @ X0) = $true) & ($true != (sub_rel @ X1 @ (cartesian_product @ (^[Y0 : $i]: ($true)) @ (^[Y0 : $i]: ($true))))))), 0.21/0.40 inference(ennf_transformation,[],[f103])). 0.21/0.40 thf(f103,plain,( 0.21/0.40 ~! [X0 : $i > $i > $o,X1 : $i > $i > $o] : (((sub_rel @ X1 @ X0) = $true) => ($true = (sub_rel @ X1 @ (cartesian_product @ (^[Y0 : $i]: ($true)) @ (^[Y0 : $i]: ($true))))))), 0.21/0.40 inference(fool_elimination,[],[f102])). 0.21/0.40 thf(f102,plain,( 0.21/0.40 ~! [X0 : $i > $i > $o,X1 : $i > $i > $o] : ((sub_rel @ X1 @ X0) => (sub_rel @ X1 @ (cartesian_product @ (^[X2 : $i] : ($true)) @ (^[X3 : $i] : ($true)))))), 0.21/0.40 inference(rectify,[],[f37])). 0.21/0.40 thf(f37,negated_conjecture,( 0.21/0.40 ~! [X14 : $i > $i > $o,X8 : $i > $i > $o] : ((sub_rel @ X8 @ X14) => (sub_rel @ X8 @ (cartesian_product @ (^[X0 : $i] : ($true)) @ (^[X0 : $i] : ($true)))))), 0.21/0.40 inference(negated_conjecture,[],[f36])). 0.21/0.40 thf(f36,conjecture,( 0.21/0.40 ! [X14 : $i > $i > $o,X8 : $i > $i > $o] : ((sub_rel @ X8 @ X14) => (sub_rel @ X8 @ (cartesian_product @ (^[X0 : $i] : ($true)) @ (^[X0 : $i] : ($true)))))), 0.21/0.40 file('/export/starexec/sandbox/tmp/tmp.jFn1ibUF28/E---3.1_20703.p',thm)). 0.21/0.40 % SZS output end Proof for E---3.1_20703 0.21/0.40 % (20815)------------------------------ 0.21/0.40 % (20815)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200) 0.21/0.40 % (20815)Termination reason: Refutation 0.21/0.40 0.21/0.40 % (20815)Memory used [KB]: 5628 0.21/0.40 % (20815)Time elapsed: 0.008 s 0.21/0.40 % (20815)Instructions burned: 6 (million) 0.21/0.40 % (20815)------------------------------ 0.21/0.40 % (20815)------------------------------ 0.21/0.40 % (20809)Success in time 0.034 s 0.21/0.40 EOF